The Computation of New Versions of Randic Index for TUC C (R) Nanotubes

نویسنده

  • A. Iranmanesh
چکیده

Recently, the subdivision Randic index was introduced. In this paper, we present new version of Randic index by using some graph operator and in related to the subdivision Randic index. Next, by using some results about this version, it is computed for TUC C (R) nanotubes. 4 8

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of Co-PI Index of TUC4C8(R) Nanotubes

In this paper, at first we introduce a new index with the name Co-PI index and obtain some properties related this new index. Then we compute this new index for TUC4C8(R) nanotubes.

متن کامل

Balaban and Randic Indices of IPR C80 Fullerene Isomers, Zigzag Nanotubes and Graphene

In this paper an algorithm for computing the Balaban and Randic indices of any simple connected graph was introduced. Also these indices were computed for IPR C80 fullerene isomers, Zigzag nanotubes and graphene by GAP program.

متن کامل

Computation of Topological Indices of Triglyceride

In this paper, we compute ABC index, Randic connectivity index, Sum connectivity index, GA index, Harmonic index, General Randic index of Triglyceride. AMS subject classification:

متن کامل

On the Edge and Total GA Indices of Nanotubes

The total version of geometric–arithmetic (GA) index of graphs is introduced based on the end-vertex degrees of edges of their total graphs. In this paper, the total GA index is computed for zigzag polyhex nanotubes by using some results on GA index and mentioned nanotubes. Also, we compute the edge GA index for the subdivision graphs of TUC C (R) and TUAC [p',q'] nanotubes. 4 8 6

متن کامل

Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013